Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
نویسندگان
چکیده
منابع مشابه
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
The Kučera-Gács theorem [Kuč85, Gác86] is a landmark result in algorithmic randomness asserting that every real is computable from a Martin-Löf random real. If the computation of the first n bits of a sequence requires n + h(n) bits of the random oracle, then h is the redundancy of the computation. Kučera implicitly achieved redundancy n log n while Gács used a more elaborate coding procedure w...
متن کاملOptimal redundancy in computations from random oracles
A classic result in algorithmic information theory is that every infinite binary sequence is computable from a Martin-Löf random infinite binary sequence. Proved independently by Kučera [Kuč85] and Gács [Gác86], this result answered a question by Charles Bennett and has seen numerous applications in the last 30 years. The optimal redundancy in such a coding process has, however, remained unknow...
متن کاملInfinite Computations with Random Oracles
We consider the following problem for various infinite time machines. If a real is computable relative to large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable? We show that the answer is independent from ZFC for ordinal time machines (OTMs) with and without ordinal parameters and give a positive answer...
متن کاملEffective martingales with restricted wagers
Computable randomness is a central notion in the theory of algorithmic randomness. An infinite sequence of bits x is computably random if no computable betting strategy can win an infinite amount of money by betting on the values of the bits of x. In the classical model, the betting strategies considered take realvalued bets. We study two restricted models, where the strategies considered take ...
متن کاملInteractive Zero-Knowledge with Restricted Random Oracles
We investigate the design and proofs of zero-knowledge (ZK) interactive systems under what we call the “restricted random oracle model” which restrains the usage of the oracle in the protocol design to that of collapsing protocol rounds a la Fiat-Shamir heuristics, and limits the oracle programmability in the security proofs. We analyze subtleties resulting from the involvement of random oracle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2016
ISSN: 0890-5401
DOI: 10.1016/j.ic.2016.09.010